Up and Down Mini-Buckets: A Scheme for Approximating Combinatorial Optimization Tasks
نویسندگان
چکیده
The paper addresses the problem of computing lower bounds on the optimal costs associated with each unary assignment of a value to a variable in combinatorial optimization problems. This task is instrumental in probabilistic reasoning and is also important for the development of admissible heuristic functions that can guide search algorithms for optimal solutions. The paper presents UD-MB, a new algorithm that applies the mini-bucket elimination idea [Dechter and Rish, 1997] to accomplish this task. We show empirically that UD-MB may achieve a substantial speed up over a bruteforce approximation method via mini-buckets.
منابع مشابه
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustable levels of accuracy and e ciency, and they can be applied uniformly across many areas and problem tasks. We introduce these algorithms in the context of combinatorial optimization and probabilistic inference.
متن کاملMini-buckets: a general scheme for approximating inference
The paper describes a class of approximation algorithms that apply the idea of local inference, known as i-consistency in constraint networks, to combinatorial optimization and to probabilistic reasoning. Our approach is based on bucket elimination [13] and o ers adjustable levels of accuracy and e ciency. We identify regions of completeness and demonstrate promising empirical results obtained ...
متن کاملA Mini-bucket-based Scheme for Approximating Combinatorial Optimization Tasks: Preliminary Results
The paper addresses the problem of computing lower bounds on the optimal costs associated with each unary assignment of a value to a variable in combinatorial optimization problems. This problem is instrumental in a variety of domains, in particular in proba-bilistic reasoning. Our aim is to use such lower bounds as a look-ahead procedure guiding search algorithms for optimal solutions. In part...
متن کاملSemi-Independent Partitioning: A Method for Approximating the Solution to Constraint Optimization Problems
In this paper we introduce a new method for approximating the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict generalization of the mini buckets algorithm [3] which allows a richer and more effective set of approximation strategies. We demonstrate with theoretical analysis and empirical results that it generally produces a b...
متن کاملMini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly, approximation methods become the best option. Mini-bucket Elimination (MBE) is a well known approximation method for combinatorial optimization problems. It has a control parameter z that allow us to trade time and s...
متن کامل